Optimizing a Radial Layout of Bipartite Graphs for a Tool Visualizing Security Alerts
نویسندگان
چکیده
Effective tools are crucial for visualizing large quantities of information. While developing these tools, numerous graph drawing problems emerge. We present solutions for reducing clutter in a radial visualization of a bipartite graph representing the alerts generated by an IDS protecting a computer network. Our solutions rely essentially on (i) unambiguous edge bundling to reduce the number of edges to display and (ii) the minimization of the total sum of the edge lengths.
منابع مشابه
InProv: Visualizing Provenance Graphs with Radial Layouts and Time-Based Hierarchical Grouping
In provenance research, the large scale of data sets often complicates analysis and understanding. One solution is visualization, a tool that enables scientists and analysts to understand large data sets. The standard format for visualizing provenance is the node-link diagram. However, while effective for understanding local activity, the node-link diagram fails to offer a high-level summary of...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملRadial Edge Splatting for Visualizing Dynamic Directed Graphs
We describe and discuss a novel radial version of a scalable dynamic graph visualization. The radial layout encodes dynamic directed graphs on narrow rings of a circle. The temporal evolution of the graph is mapped to rings that grow outward from the center of the circle. Graph vertices are placed equidistantly at the borderlines of each ring. Graph edges are displayed as curved lines starting ...
متن کاملA generalization of Villarreal's result for unmixed tripartite graphs
In this paper we give a characterization of unmixed tripartite graphs under certain conditions which is a generalization of a result of Villarreal on bipartite graphs. For bipartite graphs two different characterizations were given by Ravindra and Villarreal. We show that these two characterizations imply each other.
متن کامل